Queues as Processes
نویسندگان
چکیده
منابع مشابه
Analysis of Queues with Markovian Service Processes∗
Markovian service process (MSP) is a model similar to the Markovian arrival process (MAP), where arrivals are replaced with service completions. The MSP can represent various queueing models such as vacation models, N -policy models and exceptional service models. We analyze MAP/MSP/1 queues and obtain a new sort of matrix-type factorization of the vector generating function for the stationary ...
متن کاملFrom Markov jump processes to spatial queues
Reading is a hobby to open the knowledge windows. Besides, it can provide the inspiration and spirit to face this life. By this way, concomitant with the technology development, many companies serve the e-book or book in soft file. The system of this book of course will be much easier. No worry to forget bringing the from markov jump processes to spatial queues book. You can open the device and...
متن کاملRandom matrices, non-colliding processes and queues
It was recently discovered by Baik, Deift and Johansson [4] that the asymptotic distribution of the length of the longest increasing subsequence in a permutation chosen uniformly at random from Sn, properly centred and normalised, is the same as the asymptotic distribution of the largest eigenvalue of an n × n GUE random matrix, properly centred and normalised, as n → ∞. This distribution had e...
متن کاملDeparture Processes of BMAP/G/1 Queues
A unified approach is applied to analyze the departure processes of finite/infinite BMAP/G/1 queueing systems for both vacationless and vacation arrangements via characterizing the moments, the z-transform of the scaled autocovariance function of interdeparture times C P (z), and lag n (n 1) co-variance of interdeparture times. From a structural point of view, knowing departure process helps on...
متن کاملLimits for Cumulative Input Processes to Queues
We establish functional central limit theorems (FCLTs) for a cumulative input process to a fluid queue from the superposition of independent on-off sources, where the on periods and off periods may have heavy-tailed probability distributions. Variants of these FCLTs hold for cumulative busy time and idle time processes associated with standard queueing models. The heavy-tailed on-period and off...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1998
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(05)80247-6